Bounds on the Number of Connected Components for Tropical Prevarieties
نویسندگان
چکیده
منابع مشابه
Bounds on the Number of Connected Components for Tropical Prevarieties
For a tropical prevariety in R given by a system of k tropical polynomials in n variables with degrees at most d, we prove that its number of the connected components is less than ( k+7n−1 3n ) · d k+n+1 . On a number of 0-dimensional connected components a better bound ( k n ) · d n k−n+1 is obtained, which extends the Bezout bound due to B. Sturmfels from the case k = n to an arbitrary k ≥ n....
متن کاملRefined bounds on the number of connected components of sign conditions on a variety
Let R be a real closed field, P,Q ⊂ R[X1, . . . , Xk] finite subsets of polynomials, with the degrees of the polynomials in P (resp. Q) bounded by d (resp. d0). Let V ⊂ Rk be the real algebraic variety defined by the polynomials in Q and suppose that the real dimension of V is bounded by k′. We prove that the number of semi-algebraically connected components of the realizations of all realizabl...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملon the number of connected components of divisibility graph for certain simple groups
the divisibility graph $mathscr{d}(g)$ for a finite group $g$ is a graph with vertex set ${rm cs}(g)setminus{1}$ where ${rm cs}(g)$ is the set of conjugacy class sizes of $g$. two vertices $a$ and $b$ are adjacent whenever $a$ divides $b$ or $b$ divides $a$. in this paper we will find the number of connected components of $mathscr{d}(g)$ where $g$ is a simple zassenhaus group or an sp...
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2016
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-016-9839-6